Optimal and Suboptimal Processor Allocation for Hypercycle-based Multiprocessors

..\bstracl-Allocalin!( nodes in a concurrenl compuler ~yslem depends on Ihe lopolo~v of Ihe system. In this work, we presenl a number of processor allocation strategies for Hypercycle based concurrenl syslems. Hypercycles is a class of multidimensional interconnection nelworks \\'hich includes such widely used networks as the binary ll-cubes, /'--ary ll-cubes, generalized hypercubes etc. The allocalion slralegies presented include a statically optimal first-fit allocation, a suboptimal-first fit, and strategies with extended search space through the inclusion of additional search lists formed by permuting the base through which a hypercycle is defined. For all these strategies, we examine their optimality and present simulation results characterizing their performance relative to each other .